Model constructions in stationary logic. II. Definable ultrapowers.
نویسندگان
چکیده
منابع مشابه
On Prucnal's Model-determinated Logic and Definable Predicates
Let L be a first-order language and let M = 〈M, I〉 be a model for L. Then every formula φ(x1, . . . , xn) of L determines a unique n-place predicate: φ = {〈a1, . . . , an〉 ∈M n : M |= φ[a1, . . . , an]} Here, of course, the notation φ(x1, . . . , xn) is used to indicate that the free variables of φ constitute a subset of {x1, . . . , xn} (see [1] p. 24). A n-placed relation R ⊆M is said to be d...
متن کاملModel-Theoretic Constructions in Fuzzy Logic with Evaluated Syntax
This paper studies the model theory as generalization of classical model theory in predicate fuzzy logic with evaluated syntax (Ev L ). There exist a lot of possibilities how to find the models of fuzzy theories. In this paper we will describe the theoretic constructions of the models in Ev L where these models are built by using elementary extensions and downward Löwenheim-Skolem-Tarski theore...
متن کاملAxiomatic Classes of Intuitionistic Models
A class of Kripke models for intuitionistic propositional logic is ‘axiomatic’ if it is the class of all models of some set of formulas (axioms). This paper discusses various structural characterisations of axiomatic classes in terms of closure under certain constructions, including images of bisimulations, disjoint unions, ultrapowers and ‘prime extensions’. The prime extension of a model is a...
متن کاملDefinable Sets in Ordered Structures. Ii
It is proved that any O-minimal structure M (in which the underlying order is dense) is strongly O-minimal (namely, every N elementarily equivalent to M is O-minimal). It is simultaneously proved that if M is 0minimal, then every definable set of n-tuples of M has finitely many "definably connected components." 0. Introduction. In this paper we study the structure of definable sets (of tuples) ...
متن کاملPreserving P - points in definable forcing II ∗
I will prove iteration and product preservation theorems related to Ppoint preservation based on the first part of the paper. I will also provide counterexamples to possible strengthenings of the presented results.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 1986
ISSN: 0029-4527
DOI: 10.1305/ndjfl/1093636616